Allocation algorithms for dynamically microprogrammable multiprocessor systems
نویسندگان
چکیده
منابع مشابه
Module Allocation for Dynamically Reconfigurable Systems
The synthesis of dynamically recon gurable systems poses some new challenges for high-level synthesis tools. In this paper, we deal with the task of module allocation as this step has a direct in uence on the performance of the dynamically recon gurable design. We propose a con guration bundling driven module allocation technique that can be used for component clustering. The basic idea is to g...
متن کاملA New Metric for Processor Allocation Schemes in Multiprocessor Systems
Recently a number of scalable interconnection networks for connecting multiple processors have been proposed. Though these networks differ in their properties such as bisection bandwidth, node degree, network diameter, and average diameter, there is one common problem that must be addressed by their designers. It should be possible to subdivide the set of processors such that the subset forms a...
متن کاملA Comprehensive Dynamic Processor Allocation Scheme for Multiprogrammed Multiprocessor Systems
Parallel execution of application programs on a multiprocessor system may lead to performance degradation if the workload of a parallel region is not large enough to amortize the overheads associated with the parallel execution. Furthermore, if too many processes are running on the system in a multiprogrammed environment, the performance of the parallel application may degrade due to resource c...
متن کاملMultiple Resource Allocation for Multiprocessor Distributed Real-Time Systems
The problem of assigning resources to tasks in general purpose computing systems has been extensively studied in the literature [2, 13, 7]. The most general form of this problem is rather complex [4] and thus heuristic approaches using simpli ed models have been used to obtain tractable solutions [1, 17]. These restricted approaches have yielded approximate solutions that are within the bounds ...
متن کاملMultiprocessor Algorithms for Relational - Database Operators on Hvpercube Systems
E xploiting parallelism in database processing has been a research goal since the early 1970s. Originally, special-purpose architectures were developed to provide the computational and input/ output bandwidth needed for database processing. More recently, many researchers have relied on commercial multiprocessor and local area networked systems by such vendors as Sequent,Tandem, BBN, DEC, and v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1979
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/22.2.155